Iterative patching and the asymmetric traveling salesman problem

Iterative patching and the asymmetric traveling salesman problem

Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter. In this paper, we investigate iterative patching, a technique in which a fixed patching procedure is applied at each node of the BnB search tree for the Asymmetric Traveling Salesman Problem. Computational experiments show that itera...

Asymmetric Traveling Salesman Problem

The asymmetric traveling salesman problem (ATSP) is one of the most fundamental problems in combinatorial optimization. An instance of ATSP is a directed complete graph G = (V,E) with edge weights w : E → N that satisfy the triangle inequality, i. e., w(a, c) ≤ w(a, b) +w(b, c) for all distinct vertices a, b, c ∈ V . The goal is to find a Hamiltonian cycle of minimum weight. The weight of a Ham...

The Asymmetric Traveling Salesman Problem

The Asymmetric Quadratic Traveling Salesman Problem

The quadratic traveling salesman problem asks for a tour of min-imal costs where the costs are associated with each two arcs that are traversedin succession. This structure arises, e. g., if the succession of two arcs representsthe costs of loading processes in transport networks or a switch between dif-ferent technologies in communication networks. Based on a quadratic integer<...

The On-line Asymmetric Traveling Salesman Problem

We consider two on-line versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+ √ 5 2 -competitive algorithm and prove that this is best possible. For the nomadic version, the on-line analogue of the shortest asymmetric hamiltonian path problem, we show tha...